Coding Theory in Projective Spaces
نویسندگان
چکیده
Given the n-dimensional space Fq , the elements of the projective spaces are all subspaces of Fq . Recently these codes have found application in error-correction of network coding. In this paper we examine a few interesting aspects of coding theory in projective spaces. We present codes and bounds in the projective spaces metric and prove that there are no perfect codes in this metric. We consider linear codes and complement codes in this metric and show some interesting phenomena. Lot of open interesting question arise from our discussion.
منابع مشابه
Hypersurfaces in weighted projective spaces over finite fields with applications to coding theory
We consider the question of determining the maximum number of Fqrational points that can lie on a hypersurface of a given degree in a weighted projective space over the finite field Fq, or in other words, the maximum number of zeros that a weighted homogeneous polynomial of a given degree can have in the corresponding weighted projective space over Fq. In the case of classical projective spaces...
متن کاملGalois geometries and coding theory
Galois geometries and coding theory are two research areas which have been interacting with each other for many decades. From the early examples linking linear MDS codes with arcs in finite projective spaces, linear codes meeting the Griesmer bound with minihypers, covering radius with saturating sets, links have evolved to functional codes, generalized projective Reed–Muller codes, and even fu...
متن کاملAn invariant for matrices and sets of points in prime characteristic
There is polynomial function Xq in the entries of an m×m(q− 1) matrix over a field of prime characteristic p, where q = p is a power of p, that has very similar properties to the determinant of a square matrix. It is invariant under multiplication on the left by a non-singular matrix, and under permutations of the columns. This gives a way to extend the invariant theory of sets of points in pro...
متن کامل